A Generalized Diagonal Wythoff Nim
نویسنده
چکیده
The P-positions of the well-known 2-pile take-away game of Wythoff Nim lie on two ‘beams’ of slope √ 5+1 2 and √ 5−1 2 respectively. We study extensions to this game where a player may also remove simultaneously pt tokens from either of the piles and qt from the other, where p < q are given positive integers and where t ranges over the positive integers. We prove that for certain pairs (p, q) the P-positions are identical to those of Wythoff Nim, but for (p, q) = (1, 2) they do not even lie on two beams. In fact, we conjecture a classification of all pairs (p, q) for which each of the two beams of P-positions of Wythoff Nim, in the new game, ‘splits’ into two distinct new beams of P-positions.
منابع مشابه
Wythoff Nim Extensions and Splitting Sequences
We study extensions of the classical impartial combinatorial game of Wythoff Nim. The games are played on two heaps of tokens, and have symmetric move options, so that, for any integers 0 ≤ x ≤ y, the outcome of the upper position (x, y) is identical to that of (y, x). First we prove that φ−1 = 2 1+ √ 5 is a lower bound for the lower asymptotic density of the x-coordinates of a given game’s upp...
متن کاملRESTRICTIONS OF m-WYTHOFF NIM AND p-COMPLEMENTARY BEATTY SEQUENCES
Fix a positive integerm. The game ofm-Wythoff Nim (A.S. Fraenkel, 1982) is a well-known extension of Wythoff Nim, a.k.a ’Corner the Queen’. Its set of P -positions may be represented by a pair of increasing sequences of non-negative integers. It is well-known that these sequences are so-called complementary homogeneous Beatty sequences, that is they satisfy Beatty’s theorem. For a positive inte...
متن کاملA Generalization of Wythoff's Game
Wythoff s game is a variation of Nim, a two-pile game in which each player removes counters in turn until the winner takes the last counter. The safe-pairs generated in the solution of Wythoff's game have many properties interesting in themselves, and are related to the canonical Zeckendorf representation of an integer using Fibonacci numbers. In Nim, the strategy is related to expressing the n...
متن کاملA polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
For any positive integer parameters a and b, the second author recently introduced a generalization mexb of the standard minimum excludant mex = mex1, along with a game NIM(a, b) that extends further Fraenkel’s NIM = NIM(a, 1), which in its turn is a generalization of the classical Wythoff NIM = NIM(1, 1). It was shown that P-positions (the kernel) of NIM(a, b) are given by the following typica...
متن کامل2-pile Nim with a Restricted Number of Move-size Imitations
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in “a strict sequence of previous player next player moves”, such an imitation takes place, the ...
متن کامل